A domain-specific language for verifying software requirement constraints
نویسندگان
چکیده
منابع مشابه
PIE: A Domain-Specific Language for Interactive Software Development Pipelines
Context. Software development pipelines are used for automating essential parts of software engineering processes, such as build automation and continuous integration testing. In particular, interactive pipelines, which process events in a live environment such as an IDE, require timely results for low-latency feedback, and persistence to retain low-latency feedback between restarts. Inquiry. D...
متن کاملA Programming Language for Writing Domain - Specific Software System
declarator : IN_ABST_DECL abst_declarator ; opt_abst_declarator : /* empty */ | abst_declarator ; abst_declarator : ‘*’ opt_cv_qualifier_list opt_abst_declarator | ‘&’ opt_cv_qualifier_list opt_abst_declarator | pointer_class_prefix opt_cv_qualifier_list opt_abst_declarator | abst_declarator1 ; abst_declarator1 : abst_declarator2 argument_declaration_set opt_cv_qualifier_list | abst_declarator3...
متن کاملA Domain Specific Language for Extracting Models in Software Modernization
Model-driven engineering techniques can be used both to create new software and to modernize existing software systems. Modeldriven software modernization requires a first step for the extraction of models. Most modernization scenarios involve dealing with the GPL source code of the existing system. Techniques and tools providing efficient means to extract models from source code are therefore ...
متن کاملA Domain-Specific Language for Software-Defined Radio
Software-defined radio (SDR) is a demanding domain; realworld wireless protocols require high data rates and low latency. Existing SDR platforms, typically based on FPGAs, provide the necessary substrate for meeting these requirements, but the high-level tools available to program them are not capable of fully exploiting the underlying hardware to meet rigorous performance requirements. Ziria [...
متن کاملAutomatically Verifying Typing Constraints for a Data Processing Language
In this paper we present a new technique for automatically verifying typing constraints in the setting of a first-order data processing language with refinement types and dynamic type-tests. We achieve this by translating programs into a standard while language and then using a general-purpose verification tool. Our translation generates assertions in the while program that faithfully represent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2020
ISSN: 0167-6423
DOI: 10.1016/j.scico.2020.102509